Funshade: Function Secret Sharing for Two-Party Secure Thresholded Distance Evaluation

نویسندگان

چکیده

We propose a novel privacy-preserving, two-party computation of various distance metrics (e.g., Hamming distance, Scalar Product) followed by comparison with fixed threshold, which is known as one the most useful and popular building blocks for many different applications including machine learning, biometric matching, etc. Our solution builds upon recent advances in function secret sharing makes use an optimized version arithmetic sharing. Thanks to this combination, our new named Funshade first require only round communication two ring elements online phase, outperforming all prior state-of-the-art schemes while relying on lightweight cryptographic primitives. Lastly, we implement from scratch portable C expose it Python, testifying its high performance running secure identification against database 1 million records ~10 seconds full correctness 32-bit precision, without parallelization.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Gate Evaluation Secret Sharing and Secure One-Round Two-Party Computation

We propose Gate Evaluation Secret Sharing (GESS) – a new kind of secret sharing, designed for use in secure function evaluation (SFE) with minimal interaction. The resulting simple and powerful GESS approach to SFE is a generalization of Yao’s garbled circuit technique. We give efficient GESS schemes for evaluating binary gates and prove (almost) matching lower bounds. We give a more efficient ...

متن کامل

Secure Multi-Party Computation from any Linear Secret Sharing Scheme

We present a general treatment of non-cryptographic (i.e. information-theoretically secure) multi-party computation, based on underlying linear secret sharing scheme. This general approach gives pure linear-algebra conditions on the linear mappings describing the scheme. The approach establishing the minimal conditions for security, can lead to design of more efficient Multi-Party Computation (...

متن کامل

Statistical Security Conditions for Two-Party Secure Function Evaluation

To simplify proofs in information-theoretic security, the standard security definition of two-party secure function evaluation based on the real/ideal model paradigm is often replaced by an informationtheoretic security definition. At EUROCRYPT 2006, we showed that most of these definitions had some weaknesses, and presented new information-theoretic conditions that were equivalent to a simulat...

متن کامل

Information-Theoretic Conditions for Two-Party Secure Function Evaluation

The standard security definition of unconditional secure function evaluation, which is based on the ideal/real model paradigm, has the disadvantage of being overly complicated to work with in practice. On the other hand, simpler ad-hoc definitions tailored to special scenarios have often been flawed. Motivated by this unsatisfactory situation, we give an information-theoretic security definitio...

متن کامل

3 party quantum secret sharing

3 The QuBit-Case 3 3.1 Assumptions . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 3 3.2 General setting . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.3 The protocol as a circuit . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . . 4 3.4 Preparation of the GHZ state . . . . . . . . . . . . . . ....

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Proceedings on Privacy Enhancing Technologies

سال: 2023

ISSN: ['2299-0984']

DOI: https://doi.org/10.56553/popets-2023-0096